package team3;

import java.util.Map;

public class MinMaxTree
{
	MinMaxTreeNode rootNode;

	public MinMaxTree(BoardState state)
	{
		//init root node with the board state
	}

	public void logMove(int[] move)
	{
		//needs to differentiate between a valid and invalid move:
		//	a valid move will match exactly one item
		//	an invalid move may match no items if only looking at equality

		//set the root node to the child of root corresponding to 'move'
	}

	public Map<int[], Double> evaluateTree(AI.Player player, int depth, GoodnessFunction goodness)
	{
		//evaluate goodness of each child of root
		//return the scores of each possible move
		return null;
	}
}
